Optimal matching problem in detection and recognition performance evaluation
نویسندگان
چکیده
منابع مشابه
Optimal matching problem in detection and recognition performance evaluation
This paper proposes a principle of one-to-one correspondence in performance evaluation of a general class of detection and recognition algorithms. Such a correspondence between ground-truth entities and algorithm declared entities is essential in accurately computing objective performance measures such as the detection, recognition, and false alarm rates. We mathematically de ne the corresponde...
متن کاملAn Optimal Matching Problem
Suppose we are given three goods, X,Y , and Z. They are not homogeneous, but come in different qualities, x ∈ X , y ∈ Y and z ∈ Z. Goods X and Y are used for the sole purpose of producing good Z, which we are interested in. To obtain one piece of good Z, one has to assemble one piece of good X and one piece of good Y . More precisely, one can obtain a piece of quality z by assembling one piece ...
متن کاملAssignment Problem in Edge Detection Performance Evaluation
We propose to use the combinatorial assignment problem to model the issue of associating ground-truth and declared edge pixels in the objective empirical performance evaluation of edge detectors. The assignment problem is adapted to the maximal assignment problem to incorporate the need for tolerating certain amount of localization error for the detected ground-truth pixels. The solution to thi...
متن کاملThe Optimal Path-Matching Problem
We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems|polynomial-time solvability, min-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm for ...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2002
ISSN: 0031-3203
DOI: 10.1016/s0031-3203(01)00204-7